Pattern Count on Multiply Restricted Permutations

نویسنده

Alina F. Y. Zhao

چکیده

Previous work has studied the pattern count on singly restricted permutations. In this work, we focus on patterns of length 3 in multiply restricted permutations, especially for double and triple pattern-avoiding permutations. We derive explicit formulae or generating functions for various occurrences of length 3 patterns on multiply restricted permutations, as well as some combinatorial interpretations for non-trivial pattern relationships. Mathematics Subject Classification: 05A05, 05A15, 05A19

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pattern Popularity in Multiply Restricted Permutations

We derive explicit formulae or generating functions for the popularity of all the length-3 patterns in multiply restricted permutations, and provide combinatorial interpretations for some non-trivial equipopular patterns as well.

متن کامل

Symmetric Permutations Avoiding Two Patterns ∗

Symmetric pattern-avoiding permutations are restricted permutations which are invariant under actions of certain subgroups of D4, the symmetry group of a square. We examine pattern-avoiding permutations with 180◦ rotational-symmetry. In particular, we use combinatorial techniques to enumerate symmetric permutations which avoid one pattern of length three and one pattern of length four. Our resu...

متن کامل

Restricted Permutations, Fibonacci Numbers, and k-generalized Fibonacci Numbers

In 1985 Simion and Schmidt showed that the number of permutations in Sn which avoid 132, 213, and 123 is equal to the Fibonacci number Fn+1. We use generating function and bijective techniques to give other sets of pattern-avoiding permutations which can be enumerated in terms of Fibonacci or k-generalized Fibonacci numbers.

متن کامل

3 1 Ju l 2 00 6 Permutations , cycles , and the pattern 2 – 13

We count the number of occurrences of restricted patterns of length 3 in permutations with respect to length and the number of cycles. The main tool is a bijection between permutations in standard cycle form and weighted Motzkin paths.

متن کامل